Mod 2 cohomology of combinatorial Grassmannians

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles. It defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles. It then gives a transformation from matroid bundles to spherical quasifibrations, by showing that the geometric realization of a matroid bundle is a spherical quasifibration. The poset of oriented matroids of a fixed rank classifies matroid bundles, and the above transformations give a splitting from topology to combinatorics back to topology. A consequence is that the mod 2 cohomology of the poset of rank k oriented matroids (this poset classifies matroid bundles) contains the free polynomial ring on the first k Stiefel-Whitney classes.     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

拟阵与概念格的关系

本文以构造的方式建立起拟阵与概念格的联系,得到在同构意义下每个拟阵是一个概念格,但反之不然的结论;该结论使得利用概念格的性质研究拟阵成为现实,特别为将建造概念格的算法尤其是已计算机化的算法应用于求取拟阵奠定了基础,也为拟阵论成为研究概念格性质的辅助工具打下基础．     

取向聚对苯二甲酸乙二酯纤维的非等温结晶动力学

取向聚对苯二甲酸乙二酯纤维的非等温结晶动力学张志英，赵家森（天津纺织工学院材料科学系天津３００１６０）关键词取向高聚物，聚对苯二甲酸乙二酯，非等温结晶，结晶动力学研究高聚物结晶动力学常用的等温方法有光透射法、密度法、显微镜法、Ｘ－射线衍射法、差示扫描...     

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids

We introduce the active partition of the ground set of an oriented matroid perspective (or morphism, or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share the same active partition. This yields an equivalence relation for the set of reorientations of an oriented matroid perspective, whose classes are enumerated by coefficients of the Tutte polynomial, and a remarkable partition of the set of reorientations into Boolean lattices, from which we get a short direct proof of a 4-variable expansion formula for the Tutte polynomial in terms of orientation activities. This formula was given in the last unpublished preprint by Michel Las Vergnas; the above equivalence relation and notion of active partition generalize a former construction in oriented matroids by Michel Las Vergnas and the author; and the possibility of such a proof technique in perspectives was announced in the aforementioned preprint. We also briefly highlight how the 5-variable expansion of the Tutte polynomial in terms of subset activities in matroid perspectives comes in a similar way from the known partition of the power set of the ground set into Boolean lattices related to subset activities (and we complete the proof with a property which was missing in the literature). In particular, the paper applies to matroids and oriented matroids on a linearly ordered ground set, and applies to graph and directed graph homomorphisms on a linearly ordered edge-set.     

Oriented hypergraphs: Balanceability

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.     

Immobilization of antibody fragment for immunosensor application based on surface plasmon resonance

Biosurface fabrication using the Fab′ fragment of immunoglobulin (IgG) was carried out by self-assembly (SA) technique. The pepsin-digested monoclonal antibody (Mab) against bovine insulin containing the F(ab′)₂ fragment and residual proteins was separated using affinity chromatography and dialysis. To prevent the nonspecific binding of F(ab′)₂ onto gold (Au) substrate, the native disulfide bridge was reduced using dithiothreitol (DTT) to convert F(ab′)₂ into Fab′, which made the immobilization to be carried out via the native thiol (–SH) group. The fabricated biosurface using SA technique showed the formation of stable thin film through AFM topography. Through the concentration change of DTT and Fab′, the absorption characteristics against the Au surface were investigated using surface plasmon resonance (SPR) with the flow cell. The amount of immobilized antibody fragment and the antigen binding capacity were regulated with respect to the reduction state and concentration of F(ab′)₂. Based on the biosurface of the fabricated Fab′, the insulin-detection was carried out by the measurement of SPR. The proposed antibody surface could successfully detect the bovine insulin at the concentration from 100 ng/mL to 10 μg/mL.     

Matroid Shellability, β-Systems,and Affine Hyperplane Arrangements

The broken-circuit complex is fundamental to the shellability and homology of matroids, geometric lattices, and linear hyperplane arrangements. This paper introduces and studies the -system of a matroid, nbc(M), whose cardinality is Crapo's -invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices, and afflne hyperplane arrangements, it is found that the -system acts as the afflne counterpart to the broken-circuit complex. In particular, it is shown that the -system indexes the homology facets for the lexicographic shelling of the reduced broken-circuit complex , and the basic cycles are explicitly constructed. Similarly, an EL-shelling for the geometric semilattice associated with M is produced,_and it is shown that the -system labels its decreasing chains.Basic cycles can be carried over from The intersection poset of any (real or complex) afflnehyperplane arrangement is a geometric semilattice. Thus the construction yields a set of basic cycles, indexed by nbc(M), for the union of such an arrangement.